The control of reasoning in resource-bounded agents

نویسندگان

  • Martijn C. Schut
  • Michael Wooldridge
چکیده

Autonomous agents are systems capable of autonomous decision making in real-time environments. Computation is a valuable resource for such decision making, and yet the amount of computation that an autonomous agent may carry out will be limited. It follows that an agent must be equipped with a mechanism that enables it to make the best possible use of the computational resources at its disposal. In this paper, we review three approaches to the control of computation in resource-bounded agents. In addition to a detailed description of each framework, this paper compares and contrasts the approaches, and lists the advantages and disadvantages of each.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

Constraint-Directed Reasoning as a Basis for Real-Time Planning

Constraint-directed reasoning has emerged as a powerful problem-solving paradigm used widely in artificial intelligence applications. This paper explores the use of constraints as a foundation for real-time planning in complex domains. We describe the function of constraints as a mechanism for representing and working with domain knowledge in resource bounded agents, and examine the types and o...

متن کامل

Knowledge, Logical Omniscience, and Resource-bounded Reasoning

Agent theories typically use modal epistemic logic for modeling knowledge of agents. Since the modal approach to epistemic logic cannot formalize resource-bounded reasoning adequately, it it not suited to describe realistic, implementable agents. We develop a framework for solving that problem. We introduce the notion of algorithmic knowledge — a concept that establishes a direct link between a...

متن کامل

Belief ascription under bounded resources

There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of b...

متن کامل

Programming Resource-Bounded Deliberative Agents

This paper is concerned with providing a common framework for both the logical specification and execution of agents. While numerous high-level agent theories have been proposed in order to model agents, such as theories of intention, these often have little formal connection to practical agentbased systems. On the other hand, many of the agent-based programming languages used for implementing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Knowledge Eng. Review

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2001